Combining Task- and Data Parallelism to Speed up Protein Folding on a Desktop Grid Platform

نویسندگان

  • Bennet Uk
  • Michela Taufer
  • Thomas Stricker
  • Giovanni Settanni
  • Andrea Cavalli
  • Amedeo Caflisch
چکیده

EXPERIENCE: 1992July 1997 Degree Laurea in Fisica, Universita' di Torino. Thesis on "Aspects of learning in realistic neural networks", supervisor Dr. Alessandro Treves(SISSA). Full marks cum laude. 1997October 1998 Master, Magister Philosophiae, SISSA, Trieste. Thesis on "Determination of optimal effective interactions between amino acids in globular proteins", supervisor prof. Amos Maritan. Full marks. 1997October 2001 Doctor Philosophiae, SISSA, Trieste. Thesis on “The role of native state topology in protein folding and dynamics”. supervisors Prof. Amos Maritan and Prof. Paolo Carloni. Approved cum laude. Since November 2001 Postdoctoral fellow in Prof. Caflisch’s Group, Biochemisches Institut, University of Zurich, Switzerland.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combining Task- and Data Parallelism to Speed up Protein Folding on a Desktop Grid Platform Is efficient protein folding possible with CHARMM on the United Devices MetaProcessor?

The steady increase of computing power at lower and lower cost enables molecular dynamics simulations to investigate the process of protein folding with an explicit treatment of water molecules. Such simulations are typically done with well known computational chemistry codes like CHARMM. Desktop grids such as the United Devices MetaProcessor are highly attractive platforms, since scavenging fo...

متن کامل

Implementation and Characterization of Protein Folding on a Desktop Computational Grid

CHARMM is a popular molecular dynamics code for computational biology. For many CHARMM applications such as protein folding, desktop grids could become viable alternatives to clusters of PCs. In this technical report, we present a prototype and discuss the viability of a protein folding application with CHARMM on the United Devices MetaProcessor, a platform for widely distributed computing. We ...

متن کامل

Implementation and Characterization of Protein Folding on a Desktop Computational Grid - Is CHARMM a Suitable Candidate for the United Devices MetaProcessor?

CHARMM is a popular molecular dynamics code for computational biology. For many CHARMM applications such as protein folding, desktop grids could become viable alternatives to clusters of PCs. In this paper, we present a prototype and discuss the viability of a protein folding application with CHARMM on the United Devices MetaProcessor, a platform for widely distributed computing. We identify th...

متن کامل

Parallel processing on block-based Gauss-Jordan algorithm for desktop grid

Two kinds of parallel possibilities exist in the block-based Gauss-Jordan (BbGJ) algorithm, which are intra-step and inter-steps based parallelism. But the existing parallel paradigm of BbGJ algorithm just aiming at the intra-step based parallelism, can‟t meet the requirement of dispatching simultaneously as many tasks as possible to computing nodes of desktop grid platform exploiting thousands...

متن کامل

A study of operators’ computing efficiency with special focus on the readability under different viewing angles of a desktop

The main objective of this work is to determine the reading performance of operators’ under different viewing angles of a desktop computer. The effects of text/background color, viewing distance and character size on the speed of reading were investigated. The text and/or the background color combination were varied, with constant luminance contrast. Performance was recorded in terms of words p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003